On Universes in Type Theory

نویسنده

  • Erik Palmgren
چکیده

The notion of a universe of types was introduced into constructive type theory by Martin-Löf (1975). According to the propositions-as-types principle inherent in type theory, the notion plays two rôles. The first is as a collection of sets or types closed under certain type constructions. The second is as a set of constructively given infinitary formulas. In this paper we discuss the notion of universe in type theory and suggest and study some useful extensions. We assume familiarity with type theory as presented in e.g. (Martin-Löf 1984). Universes have been effective in expanding the realm of constructivism. One example is constructive category theory where type universes take the rôles of Grothendieck universes of sets, in handling large categories. A more profound example is Aczel’s (1986) type-theoretic interpretation of constructive set theory (CZF). It is done by coding ∈-diagrams into well-order types, with branching over an arbitrary type of the universe. The latter generality is crucial to interpret the separation axiom. The introduction of universes and well-orders (W-types) in conjunction gives a great proof-theoretic strength. This has provided constructive justification of strong subsystems of second order arithmetic studied by proof-theorists (see Griffor and Rathjen (1994) and Setzer (1993), and for some early results, see Palmgren (1992)). At present, it appears that the most easily justifiable way to increase the proof-theoretic strength of type theory is to introduce ever more powerful universe constructions. We will give two such extensions in this paper. Besides contributing to the understanding of subsystems of second order arithmetic and pushing the limits of inductive definability, such constructions provide intuitionistic analogues of large cardinals (Rathjen et al. to appear). A third new use of universes is to facilitate the incorporation of classical reasoning into constructive type theory. We introduce a universe of classical propositions and prove a conservation result for ‘Π2-formulas’. Extracting programs from classical proofs is then tractable within type theory. The next section gives an introduction to the notion of universe. The central part of the paper is Section 3 where we introduce a universe forming operator and a super universe closed under this operator. Section 4 summarises what is known

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-granulation fuzzy probabilistic rough sets and their corresponding three-way decisions over two universes

This article introduces a general framework of multi-granulation fuzzy probabilistic roughsets (MG-FPRSs) models in multi-granulation fuzzy probabilistic approximation space over twouniverses. Four types of MG-FPRSs are established, by the four different conditional probabilitiesof fuzzy event. For different constraints on parameters, we obtain four kinds of each type MG-FPRSs...

متن کامل

Supersymmetric Gödel Universes in String Theory

Supersymmetric backgrounds in string and M-theory of the Gödel Universe type are studied. We find several new Gödel Universes that preserve up to 20 supersymmetries. In particular, we obtain an interesting Gödel Universe in M-theory with 18 supersymmetries which does not seem to be dual to a pp-wave. We show that not only T-duality but also the typeIIA/M-theory S-duality can give supersymmetric...

متن کامل

Granular Structure of Type-2 Fuzzy Rough Sets over Two Universes

Granular structure plays a very important role in the model construction, theoretical analysis and algorithm design of a granular computing method. The granular structures of classical rough sets and fuzzy rough sets have been proven to be clear. In classical rough set theory, equivalence classes are basic granules, and the lower and upper approximations of a set can be computed by those basic ...

متن کامل

Denotational semantics for guarded dependent type theory

We present a new model of Guarded Dependent Type Theory (GDTT), a type theory with guarded recursion and multiple clocks in which one can program with, and reason about coinductive types. Productivity of recursively defined coinductive programs and proofs is encoded in types using guarded recursion, and can therefore be checked modularly, unlike the syntactic checks implemented in modern proof ...

متن کامل

Universe Polymorphism in Coq

Universes are used in Type Theory to ensure consistency by checking that definitions are well-stratified according to a certain hierarchy. In the case of the Coq proof assistant, based on the predicative Calculus of Inductive Constructions (pCIC), this hierachy is built from an impredicative sort Prop and an infinite number of predicative Typei universes. A cumulativity relation represents the ...

متن کامل

Computational Higher Type Theory III: Univalent Universes and Exact Equality

This is the third in a series of papers extending Martin-Löf’s meaning explanations of dependent type theory to a Cartesian cubical realizability framework that accounts for higherdimensional types. We extend this framework to include a cumulative hierarchy of univalent Kan universes of Kan types; exact equality and other pretypes lacking Kan structure; and a cumulative hierarchy of pretype uni...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998